0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.12/0.33 % Computer : n016.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 07:22:49 EDT 2025 0.12/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.sCezSOHzrP/E---3.1_6135.p 0.20/0.51 # Version: 3.0.0-ho 0.20/0.51 # Preprocessing class: HSSSSMSSSLSNHSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.51 # Starting post_as_ho12 with 1200s (5) cores 0.20/0.51 # Starting post_as_ho4 with 240s (1) cores 0.20/0.51 # Starting lpo8_s with 240s (1) cores 0.20/0.51 # Starting sh5l with 240s (1) cores 0.20/0.51 # lpo8_s with pid 6215 completed with status 0 0.20/0.51 # Result found by lpo8_s 0.20/0.51 # Preprocessing class: HSSSSMSSSLSNHSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.51 # Starting post_as_ho12 with 1200s (5) cores 0.20/0.51 # Starting post_as_ho4 with 240s (1) cores 0.20/0.51 # Starting lpo8_s with 240s (1) cores 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0) 0.20/0.51 # Search class: HGUSS-FFSF21-SHSFMSBN 0.20/0.51 # partial match(3): HGUSF-FFSF21-SSSFFSBN 0.20/0.51 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.20/0.51 # Starting post_as_ho12 with 145s (1) cores 0.20/0.51 # post_as_ho12 with pid 6217 completed with status 0 0.20/0.51 # Result found by post_as_ho12 0.20/0.51 # Preprocessing class: HSSSSMSSSLSNHSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.51 # Starting post_as_ho12 with 1200s (5) cores 0.20/0.51 # Starting post_as_ho4 with 240s (1) cores 0.20/0.51 # Starting lpo8_s with 240s (1) cores 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0) 0.20/0.51 # Search class: HGUSS-FFSF21-SHSFMSBN 0.20/0.51 # partial match(3): HGUSF-FFSF21-SSSFFSBN 0.20/0.51 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.20/0.51 # Starting post_as_ho12 with 145s (1) cores 0.20/0.51 # Preprocessing time : 0.001 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 thf(decl_sort1, type, iS: $tType). 0.20/0.51 thf(decl_23, type, c0: iS). 0.20/0.51 thf(decl_24, type, cJOIN: iS > iS > iS > $o). 0.20/0.51 thf(decl_25, type, cP: iS > iS > iS). 0.20/0.51 thf(decl_26, type, cS_JOIN_CLOS: iS > (iS > iS > iS) > (iS > iS > iS > $o) > $o). 0.20/0.51 thf(decl_27, type, esk1_1: (iS > $o) > iS). 0.20/0.51 thf(decl_28, type, esk2_1: (iS > $o) > iS). 0.20/0.51 thf(decl_29, type, esk3_0: iS). 0.20/0.51 thf(cS_JOIN_CLOS_def, axiom, ((cS_JOIN_CLOS)=(^[X1:iS, X2:iS > iS > iS, X3:iS > iS > iS > $o]:(((![X4:iS]:((X3 @ X4 @ X1 @ X4))&![X5:iS]:((X3 @ X1 @ X5 @ X5)))&![X4:iS, X5:iS, X6:iS, X7:iS, X8:iS, X9:iS]:((((X3 @ X4 @ X5 @ X6)&(X3 @ X7 @ X8 @ X9))=>(X3 @ (X2 @ X4 @ X7) @ (X2 @ X5 @ X8) @ (X2 @ X6 @ X9)))))))), file('/export/starexec/sandbox/tmp/tmp.sCezSOHzrP/E---3.1_6135.p', cS_JOIN_CLOS_def)). 0.20/0.51 thf(cTHM580_pme, conjecture, (![X4:iS]:((cJOIN @ X4 @ X4 @ X4))<=(((![X4:iS, X5:iS, X7:iS, X8:iS]:(((((X7)=(X8))&((X4)=(X5)))<=((cP @ X4 @ X7)=(cP @ X5 @ X8))))&(cS_JOIN_CLOS @ c0 @ cP @ cJOIN))&![X10:iS > $o]:((((X10 @ c0)&![X4:iS, X5:iS]:(((X10 @ (cP @ X4 @ X5))<=((X10 @ X4)&(X10 @ X5)))))=>![X4:iS]:((X10 @ X4)))))&![X4:iS, X5:iS]:(((cP @ X4 @ X5)!=(c0))))), file('/export/starexec/sandbox/tmp/tmp.sCezSOHzrP/E---3.1_6135.p', cTHM580_pme)). 0.20/0.51 thf(c_0_2, plain, ((cS_JOIN_CLOS)=(^[Z0/* 19 */:iS, Z1:iS > iS > iS, Z2:iS > iS > iS > $o]:(((![X4:iS]:((Z2 @ X4 @ Z0 @ X4))&![X5:iS]:((Z2 @ Z0 @ X5 @ X5)))&![X4:iS, X5:iS, X6:iS, X7:iS, X8:iS, X9:iS]:((((Z2 @ X4 @ X5 @ X6)&(Z2 @ X7 @ X8 @ X9))=>(Z2 @ (Z1 @ X4 @ X7) @ (Z1 @ X5 @ X8) @ (Z1 @ X6 @ X9)))))))), inference(fof_simplification,[status(thm)],[cS_JOIN_CLOS_def])). 0.20/0.51 thf(c_0_3, negated_conjecture, ~(((((![X4:iS, X5:iS, X7:iS, X8:iS]:((((cP @ X4 @ X7)=(cP @ X5 @ X8))=>(((X7)=(X8))&((X4)=(X5)))))&((![X22:iS]:((cJOIN @ X22 @ c0 @ X22))&![X23:iS]:((cJOIN @ c0 @ X23 @ X23)))&![X24:iS, X25:iS, X26:iS, X27:iS, X28:iS, X29:iS]:((((cJOIN @ X24 @ X25 @ X26)&(cJOIN @ X27 @ X28 @ X29))=>(cJOIN @ (cP @ X24 @ X27) @ (cP @ X25 @ X28) @ (cP @ X26 @ X29))))))&![X10:iS > $o]:((((X10 @ c0)&![X4:iS, X5:iS]:((((X10 @ X4)&(X10 @ X5))=>(X10 @ (cP @ X4 @ X5)))))=>![X4:iS]:((X10 @ X4)))))&![X4:iS, X5:iS]:(((cP @ X4 @ X5)!=(c0))))=>![X4:iS]:((cJOIN @ X4 @ X4 @ X4)))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM580_pme]), c_0_2])])). 0.20/0.51 thf(c_0_4, negated_conjecture, ![X30:iS, X31:iS, X32:iS, X33:iS, X34:iS, X35:iS, X36:iS, X37:iS, X38:iS, X39:iS, X40:iS, X41:iS, X42:iS > $o, X45:iS, X46:iS, X47:iS]:(((((((((X32)=(X33))|((cP @ X30 @ X32)!=(cP @ X31 @ X33)))&(((X30)=(X31))|((cP @ X30 @ X32)!=(cP @ X31 @ X33))))&(((cJOIN @ X34 @ c0 @ X34)&(cJOIN @ c0 @ X35 @ X35))&(~(cJOIN @ X36 @ X37 @ X38)|~(cJOIN @ X39 @ X40 @ X41)|(cJOIN @ (cP @ X36 @ X39) @ (cP @ X37 @ X40) @ (cP @ X38 @ X41)))))&((((X42 @ (esk1_1 @ X42))|~(X42 @ c0)|(X42 @ X45))&((X42 @ (esk2_1 @ X42))|~(X42 @ c0)|(X42 @ X45)))&(~(X42 @ (cP @ (esk1_1 @ X42) @ (esk2_1 @ X42)))|~(X42 @ c0)|(X42 @ X45))))&((cP @ X46 @ X47)!=(c0)))&~(cJOIN @ esk3_0 @ esk3_0 @ esk3_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])). 0.20/0.51 thf(c_0_5, negated_conjecture, ![X1:iS, X10:iS > $o]:(((X10 @ (esk2_1 @ X10))|(X10 @ X1)|~((X10 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 thf(c_0_6, negated_conjecture, ![X1:iS]:((cJOIN @ c0 @ X1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 thf(c_0_7, negated_conjecture, ![X1:iS, X10:iS > $o]:(((X10 @ (esk1_1 @ X10))|(X10 @ X1)|~((X10 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 thf(c_0_8, negated_conjecture, ![X1:iS]:(((cJOIN @ (esk2_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))))|(cJOIN @ X1 @ X1 @ X1))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.20/0.51 thf(c_0_9, negated_conjecture, ![X1:iS]:(((cJOIN @ (esk1_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))))|(cJOIN @ X1 @ X1 @ X1))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 0.20/0.51 thf(c_0_10, negated_conjecture, ![X1:iS, X10:iS > $o]:(((X10 @ X1)|~((X10 @ (cP @ (esk1_1 @ X10) @ (esk2_1 @ X10))))|~((X10 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 thf(c_0_11, negated_conjecture, ![X1:iS, X4:iS, X5:iS, X6:iS, X7:iS, X8:iS]:(((cJOIN @ (cP @ X1 @ X6) @ (cP @ X4 @ X7) @ (cP @ X5 @ X8))|~((cJOIN @ X1 @ X4 @ X5))|~((cJOIN @ X6 @ X7 @ X8)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 thf(c_0_12, negated_conjecture, ![X1:iS]:((cJOIN @ X1 @ c0 @ X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 thf(c_0_13, negated_conjecture, (cJOIN @ (esk2_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_8])). 0.20/0.51 thf(c_0_14, negated_conjecture, (cJOIN @ (esk1_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((cJOIN @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_9])). 0.20/0.51 thf(c_0_15, negated_conjecture, ~((cJOIN @ esk3_0 @ esk3_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 thf(c_0_16, negated_conjecture, ![X1:iS]:((cJOIN @ X1 @ X1 @ X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])]), c_0_13]), c_0_14])])). 0.20/0.51 thf(c_0_17, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16])]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 7 0.20/0.51 # Removed by relevancy pruning/SinE : 5 0.20/0.51 # Initial clauses : 10 0.20/0.51 # Removed in clause preprocessing : 0 0.20/0.51 # Initial clauses in saturation : 10 0.20/0.51 # Processed clauses : 64 0.20/0.51 # ...of these trivial : 5 0.20/0.51 # ...subsumed : 12 0.20/0.51 # ...remaining for further processing : 47 0.20/0.51 # Other redundant clauses eliminated : 36 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 10 0.20/0.51 # Backward-rewritten : 3 0.20/0.51 # Generated clauses : 326 0.20/0.51 # ...of the previous two non-redundant : 230 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 0 0.20/0.51 # Paramodulations : 224 0.20/0.51 # Factorizations : 24 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 63 0.20/0.51 # Disequality decompositions : 0 0.20/0.51 # Total rewrite steps : 47 0.20/0.51 # ...of those cached : 31 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 24 0.20/0.51 # Positive orientable unit clauses : 11 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 1 0.20/0.51 # Non-unit-clauses : 12 0.20/0.51 # Current number of unprocessed clauses: 43 0.20/0.51 # ...number of literals in the above : 124 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 23 0.20/0.51 # Clause-clause subsumption calls (NU) : 38 0.20/0.51 # Rec. Clause-clause subsumption calls : 35 0.20/0.51 # Non-unit clause-clause subsumptions : 3 0.20/0.51 # Unit Clause-clause subsumption calls : 11 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 22 0.20/0.51 # BW rewrite match successes : 13 0.20/0.51 # Condensation attempts : 0 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 21533 0.20/0.51 # Search garbage collected termcells : 467 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.016 s 0.20/0.51 # System time : 0.004 s 0.20/0.51 # Total time : 0.020 s 0.20/0.51 # Maximum resident set size: 1956 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.017 s 0.20/0.51 # System time : 0.006 s 0.20/0.51 # Total time : 0.023 s 0.20/0.51 # Maximum resident set size: 1744 pages 0.20/0.51 % E exiting 0.20/0.51 % E exiting 0.20/0.51 EOF